def find_prime():
    n = int(input("请输入一个数字:"))

    for i in range(2, n):
        if n % i == 0:

            return False
    else:
        return True


# 打印100内的素数
def find_p():
    list = [node for node in range(1, 10001)]
    for i in range(2, 10001):
        for j in range(2, i):
            if i % j == 0:
                list.remove(i)
                break
        


    return list


if __name__ == '__main__':


     print(len(find_p()))
